Automatic construction of CSP programs from sequential non-deterministic programs
نویسندگان
چکیده
منابع مشابه
Non Deterministic Logic Programs
Non deterministic applications arise in many domains, including, stochastic optimization, multi-objectives optimization, stochastic planning, contingent stochastic planning, reinforcement learning, reinforcement learning in partially observable Markov decision processes, and conditional planning. We present a logic programming framework called non deterministic logic programs, along with a decl...
متن کاملExtracting Non-Deterministic Concurrent Programs
We introduce an extension of intuitionistic fixed point logic by a modal operator facilitating the extraction of non-deterministic concurrent programs from proofs. We apply this extension to program extraction in computable analysis, more precisely, to computing with Tsuiki’s infinite Gray code for real numbers. 1998 ACM Subject Classification F.1.2 Modes of Computation, F.3.1 Specifying and Ve...
متن کاملAutomatic Construction of Special Purpose Programs
According to the usual formulation of the automatic programming task, one starts with a specification of a programming problem, and seeks to automatically construct a program satisfying that specification. This paper concerns a different style of automatic programming. Rather than defining the class of programming problems to be dealt with by the language in which those problems are formulated,...
متن کاملAutomatic Construction of Java Programs from Functional Program Specifications
This paper presents a novel approach to construct Java programs automatically from the input functional program specifications on natural numbers from the constructive proofs of the input specifications using an inductive theorem prover called Poiti′n. The construction of a Java program from the input functional program specification involves two phases. The theorem prover is used to construct ...
متن کاملConversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs
The paper considers the problem of converting axioms in predicate calculus to deterministic programs, which are to be used as "rules" by a GPS-type supervisor. It is shown that this can be done, but that the "objects" must then contain procedure closures or "FUN-ARG-expressions" which are later applied. Background-Retrieval of Implicit information in a semantic data base is a kind of deduction....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1985
ISSN: 0167-6423
DOI: 10.1016/0167-6423(85)90016-4